A Nelder-Mead Tuner for Svm
ثبت نشده
چکیده
Read at your own risk, as this is a working document and has not yet been checked!
منابع مشابه
A HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION
In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...
متن کاملOptimization of Svm Parameters for Promoter Recognition in Dna Sequences
Recognition of specific functionally-important DNA sequence fragments is considered one of the most important problems in bioinformatics. One type of such fragments are promoters, i.e., short regulatory DNA sequences located upstream of a gene. Detection of promoters in DNA sequences is important for successful gene prediction. In this paper, Support Vector Machine (SVM) is used for classificat...
متن کاملNelder-Mead algorithm optimization and Galerkin’s method thermal performance analysis of circular porous fins with various profiles in fully wet conditions
The main objective of this research is to analyze optimization and the thermal performance of circular porous fins with four different profiles, rectangular, convex, triangular and concave under fully wet conditions. In this research, a linear model was used for the relationship between humidity and temperature. Also, modeling is assumed one-dimensional and the temperature changes only in the d...
متن کاملImplementing the Nelder-Mead simplex algorithm with adaptive parameters
In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent property when the objective function is uniformly convex. This property provides some new insights on why the standard Nelder-Mead algorithm becomes inefficient in high dimensions. We then propose an implementation of the Nelder-Mead method in which the expansion, contra...
متن کاملConvergence Properties of the Nelder-Mead Simplex Method in Low Dimensions
The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper presents convergence properties of the Nelder–Mead algorithm applied to strictly convex functions in dimensio...
متن کامل